Separating Sessions Smoothly

نویسندگان

چکیده

This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for functional programming with session types that enjoys deadlock freedom, confluence, strong normalisation. HGV exploits hyper-environments, which are collections of type environments, to ensure structural congruence is preserving. As consequence we obtain an operational correspondence between HCP -- process based on hypersequents in propositions-as-types classical linear logic (CLL). Our translations from vice-versa both preserve reflect reduction. scales smoothly support Girard's Mix rule, crucial ingredient channel forwarding exceptions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Separating Interleaved HTTP Sessions Using a Stochastic Model

We describe a novel method for interleaved HTTP session reconstruction based on first order Markov model. Interleaved session is generated by a user who is concurrently browsing a web site in two or more web sessions (browser windows). In order to assure data quality for subsequent phases in analyzing user’s browsing behavior, such sessions need to be separated in advance. We propose a separati...

متن کامل

Smoothly Mixing Regressions

This paper extends the conventional Bayesian mixture of normals model by permitting state probabilities to depend on observed covariates. The dependence is captured by a simple multinomial probit model. A conventional and rapidly mixing MCMC algorithm provides access to the posterior distribution at modest computational cost. This model is competitive with existing econometric models, as docume...

متن کامل

On smoothly superslice knots

We find smoothly slice (in fact doubly slice) knots in the 3-sphere with trivial Alexander polynomial that are not superslice, answering a question posed by Livingston and Meier.

متن کامل

New coins from old, smoothly

Given a (known) function f : [0, 1] → (0, 1), we consider the problem of simulating a coin with probability of heads f(p) by tossing a coin with unknown heads probability p, as well as a fair coin, N times each, where N may be random. The work of Keane and O’Brien (1994) implies that such a simulation scheme with IPp(N < ∞) = 1 exists iff f is continuous. Nacu and Peres (2005) proved that f is ...

متن کامل

More Smoothly Real Compact Spaces

A topological space X is called A-real compact, if every algebra homomorphism from A to the reals is an evaluation at some point of X, where A is an algebra of continuous functions. Our main interest lies on algebras of smooth functions. In [AdR] it was shown that any separable Banach space is smoothly real compact. Here we generalize this result to a huge class of locally convex spaces includi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2023

ISSN: ['1860-5974']

DOI: https://doi.org/10.46298/lmcs-19(3:3)2023